#include<bits/stdc++.h>
using namespace std;
const int N=200000+25;
priority_queue<int,vector<int>,greater<int> >q;
int a[N];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        q.push(a[i]);
    }
    int cnt=1,sum=0;
    int tmp=q.top();
    q.pop();
    while(!q.empty()&&tmp==q.top()){
        q.pop();
        cnt++;
    }
    if(q.empty()){
        cout<<n<<endl;
        return 0;
    }
    

    while(!q.empty()){
        sum=1;
        int tmp=q.top();
        q.pop();
        while(!q.empty()&&tmp==q.top()){
            q.pop();
            sum++;
        }
        if(cnt=max(cnt,sum));
    }
    cout<<cnt<<endl;
    return 0;
} 